@inproceedings{Beigel1999,
address = "Omni Inner Harbor Hotel, Baltimore, Maryland, USA",
author = "Beigel, Richard",
booktitle = "SODA 1999: the 10th Annual ACM-SIAM Symposium on Discrete Algorithms",
editor = "Tarjan, Robert E. and Warnow, Tandy",
isbn = "0-89871-434-6",
link = "http://dl.acm.org/citation.cfm?id=314500.314969",
month = "jan",
pages = "856--857",
publisher = "Society for Industrial and Applied Mathematics",
title = "Finding maximum independent sets in sparse and general graphs",
uri = "http://dl.acm.org/citation.cfm?id=314500.314969",
year = "1999",
zzzdoi = "MY/Beigel_1999_314500.314969",
}
@article{Chang1994a,
author = "Chang, Y.H. and Wang, J.S. and Lee, R.C.T.",
doi = "10.1016/0020-0255(94)90013-2",
issn = "00200255",
journal = "Information Sciences",
link = "http://www.sciencedirect.com/science/article/pii/0020025594900132 http://linkinghub.elsevier.com/retrieve/pii/0020025594900132",
month = "jan",
number = "3-4",
pages = "279--296",
title = "Generating all maximal independent sets on trees in lexicographic order",
uri = "http://www.sciencedirect.com/science/article/pii/0020025594900132",
volume = "76",
year = "1994",
}
@article{Eppstein2003a,
author = "Eppstein, David",
doi = "10.7155/jgaa.00064",
issn = "1526-1719",
journal = "Journal of Graph Algorithms and Applications",
link = "http://www.emis.ams.org/journals/JGAA/accepted/2003/Eppstein2003.7.2.pdf http://jgaa.info/getPaper?id=64",
number = "2",
pages = "131--140",
title = "Small Maximal Independent Sets and Faster Exact Graph Coloring",
uri = "http://www.emis.ams.org/journals/JGAA/accepted/2003/Eppstein2003.7.2.pdf",
volume = "7",
year = "2003",
}
@article{Johnson1988,
author = "Johnson, David S. and Yannakakis, Mihalis and Papadimitriou, Christos H.",
doi = "10.1016/0020-0190(88)90065-8",
issn = "00200190",
journal = "Information Processing Letters",
link = "http://www.sciencedirect.com/science/article/pii/0020019088900658 http://linkinghub.elsevier.com/retrieve/pii/0020019088900658",
month = "mar",
number = "3",
pages = "119--123",
title = "On generating all maximal independent sets",
uri = "http://www.sciencedirect.com/science/article/pii/0020019088900658",
volume = "27",
year = "1988",
}
@article{Kashiwabara1992,
author = "Kashiwabara, Toshinobu and Masuda, Sumio and Nakajima, Kazuo and Fujisawa, Toshio",
doi = "10.1016/0196-6774(92)90012-2",
issn = "01966774",
journal = "Journal of Algorithms",
link = "http://www.sciencedirect.com/science/article/pii/0196677492900122",
month = "mar",
number = "1",
pages = "161--174",
title = "Generation of Maximum Independent Sets of a Bipartite Graph and Maximum Cliques of a Circular-Arc Graph",
uri = "http://www.sciencedirect.com/science/article/pii/0196677492900122",
volume = "13",
year = "1992",
}
@article{Leung1984,
author = "Leung, Joseph Y.-T.",
doi = "10.1016/0196-6774(84)90037-3",
issn = "01966774",
journal = "Journal of Algorithms",
link = "http://www.sciencedirect.com/science/article/pii/0196677484900373 http://linkinghub.elsevier.com/retrieve/pii/0196677484900373",
month = "mar",
number = "1",
pages = "22--35",
title = "Fast Algorithms for Generating All Maximal Independent Sets of Interval, Circular-Arc and Chordal Graphs",
uri = "http://www.sciencedirect.com/science/article/pii/0196677484900373",
volume = "5",
year = "1984",
}
@article{Loukakis1981,
author = "Loukakis, E. and Tsouros, C.",
doi = "10.1007/BF02277184",
issn = "0010-485X",
journal = "Computing",
link = "http://link.springer.com/10.1007/BF02277184",
month = "dec",
number = "4",
pages = "349--366",
title = "A Depth First Search Algorithm to Generate the Family of Maximal Independent Sets of a Graph Lexicographically",
uri = "http://link.springer.com/10.1007/BF02277184",
volume = "27",
year = "1981",
}
@article{Minty1980,
author = "Minty, George J.",
doi = "10.1016/0095-8956(80)90074-X",
issn = "00958956",
journal = "Journal of Combinatorial Theory, Series B",
link = "http://linkinghub.elsevier.com/retrieve/pii/009589568090074X",
month = "jun",
number = "3",
pages = "284--304",
title = "On maximal independent sets of vertices in claw-free graphs",
uri = "http://linkinghub.elsevier.com/retrieve/pii/009589568090074X",
volume = "28",
year = "1980",
}
@inproceedings{Okamoto2005a,
address = "Metz, France",
author = "Okamoto, Y and Uno, T and Uehara, R",
booktitle = "WG 2005: the 31st International Workshop on Graph-Theoretic Concepts in Computer Science",
doi = "10.1007/11604686_38",
editor = "Kratsch, Dieter",
keyword = "chordal graph,completeness,counting,enumeration,independent set,np-,p-completeness,polynomial time algorithm",
link = "http://link.springer.com/chapter/10.1007/11604686_38",
month = "jun",
pages = "433--444",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Linear time counting algorithms for independent sets in chordal graphs",
uri = "http://link.springer.com/chapter/10.1007/11604686_38",
volume = "3787",
year = "2005",
}
@article{Okamoto2008,
author = "Okamoto, Yoshio and Uno, Takeaki and Uehara, Ryuhei",
doi = "10.1016/j.jda.2006.07.006",
issn = "15708667",
journal = "Journal of Discrete Algorithms",
keyword = "chordal graph,counting,enumeration,independent set,np -completeness,p -completeness,polynomial time algorithm",
link = "http://linkinghub.elsevier.com/retrieve/pii/S1570866707000330",
month = "jun",
number = "2",
pages = "229--242",
title = "Counting the number of independent sets in chordal graphs",
uri = "http://linkinghub.elsevier.com/retrieve/pii/S1570866707000330",
volume = "6",
year = "2008",
}
@article{Tsukiyama1977a,
author = "Tsukiyama, Shuji and Ide, Mikio and Ariyoshi, Hiromu and Shirakawa, Isao",
doi = "10.1137/0206036",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "1,4,6,algorithm,all the maximal independent,and is also interesting,backtracking,graph,in terms of complexity,introduction,is fundamental in the,its applications,maximal clique,maximal cliques,maximal independent set,of computation,or,sets,the efficient search for,theory of graphs and",
link = "http://epubs.siam.org/doi/abs/10.1137/0206036",
month = "sep",
number = "3",
pages = "505--517",
title = "A New Algorithm for Generating All the Maximal Independent Sets",
uri = "http://epubs.siam.org/doi/abs/10.1137/0206036",
volume = "6",
year = "1977",
}